New bounds for pairwise orthogonal diagonal Latin squares
نویسنده
چکیده
A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. Let dr be the least integer such that for all n > dr there exist r pairwise orthogonal diagonal Latin squares of order n. In a previous paper Wallis and Zhu gave several bounds on the dr. In this paper we shall present some constructions of pairwise orthogonal diagonal Latin squares and consequently obtain new bounds for five pairwise orthogonal diagonal Latin squares.
منابع مشابه
More mutually orthogonal Latin squares
A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. In this paper we give some constructions of pairwise orthogonal diagonal Latin squares. As an application of such constructions we obtain some new infinite classes of pairwise orthogonal diagonal Latin squares which are useful in the study of pairwise orthogonal diagonal Latin squares.
متن کاملUpper bounds on sets of orthogonal colorings of graphs
We generalize the notion of orthogonal latin squares to colorings of simple graphs. Two n-colorings of a graph are said to be orthogonal if whenever two vertices share a color in one coloring they have distinct colors in the other coloring. We show that the usual bounds on the maximum size of a certain set of orthogonal latin structures such as latin squares, row latin squares, equi-n squares, ...
متن کاملOn the existence of self-orthogonal diagonal Latin squares
A diagonal Latin square is a Latin square whose main diagonal and back diagonal are both transversals. A Latin square is self-orthogonal if it is orthogonal to its transpose. In an earlier paper Danhof, Phillips and Wallis considered the question of the existence of self-orthogonal diagonal Latin squares of order 10. In this paper we shall present some constructions of self-orthogonal diagonal ...
متن کاملThe Search for Systems of Diagonal Latin Squares Using the SAT@home Project
In this paper we consider the approach to solving the problem of search for systems of diagonal orthogonal Latin squares in the form of the Boolean Satisfiability problem. We describe two different propositional encodings that we use. The first encoding is constructed for finding pairs of orthogonal diagonal Latin squares of order 10. Using this encoding we managed to find 17 previously unknown...
متن کاملA short note regarding existence of complete sets of orthogonal diagonal Sudoku squares
In an earlier paper, [A.D. Keedwell, Australas J. Combin. 47 (2010), 227–238], we proved that complete sets of orthogonal diagonal Sudoku latin squares exist of all orders p, where p is a prime. We also showed that complete sets of orthogonal Sudoku latin squares which are left semidiagonal exist of all orders p, s > 1, and we conjectured that these may be right semi-diagonal also but we were n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 7 شماره
صفحات -
تاریخ انتشار 1993